An XML based General Document Algebra
نویسندگان
چکیده
HypereiDoc [1] is an XML based framework that has been designed to support multi-layered processing of epigraphical, papyrological or similar texts in a cooperative, and distributed manner for modern critical editions. Creating an edition, philologists may however face the problem that a prepared edition is, semantically unjust. The reason behind semantically damaged editions is merging virtual text-documents made by different scholar teams that may annotate the same piece of text independently of each other. As nor detection, neither resolution of such semantic casualties is currently supported by the framework, in this paper we explore and analyze possible semantic problems, and extend the mathematical model of HypereiDoc in order to capture, and present possible solutions for them.
منابع مشابه
Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML
As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...
متن کاملApply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML
As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...
متن کاملA Tree Based Algebra Framework for XML Data Systems
This paper introduces a framework in algebra for processing XML data. We develop a simple algebra, called TA (Tree Algebra), for processing storing and manipulating XML data, modelled as trees. We present assumptions of the framework, describe the input and the output of the algebraic operators, and define the syntax of these operators and their semantics in terms of algorithms. Furthermore we ...
متن کاملXML Database Transformations
Database transformations provide a unifying umbrella for queries and updates. In general, they can be characterised by five postulates, which constitute the database analogue of Gurevich’s sequential ASM thesis. Among these postulates the background postulate supposedly captures the particularities of data models and schemata. For the characterisation of XML database transformations the natural...
متن کاملAn Algebra for Probabilistic XML Retrieval
In this paper, we describe a new algebra for XML retrieval. We first describe how to transform an XPath-like query in our algebra. The latter contains a vague predicate, about, which defines a set of document parts within an XML document that fullfill a query expressed as in “flat” Information Retrieval – a query that contains only constraints on content but not on structure. This predicate is ...
متن کاملخوشهبندی فراابتکاری اسناد فارسی اِکساِماِل مبتنی بر شباهت ساختاری و محتوایی
Due to the increasing number of documents, XML, effectively organize these documents in order to retrieve useful information from them is essential. A possible solution is performed on the clustering of XML documents in order to discover knowledge. Clustering XML documents is a key issue of how to measure the similarity between XML documents. Conventional clustering of text documents using a do...
متن کامل